A Centrally Symmetric Version of the Cyclic Polytope

نویسندگان

  • Alexander I. Barvinok
  • Isabella Novik
چکیده

We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes with n vertices of a given even dimension d = 2k when d is fixed and n grows. For a fixed even dimension d = 2k and an integer 1 ≤ j < k we prove that the maximum possible number of j-dimensional faces of a centrally symmetric d-dimensional polytope with n vertices is at least (cj(d) + o(1)) ( n j+1 ) for some cj(d) > 0 and at most ( 1− 2 + o(1) ) ( n j+1 ) as n grows. We also show that c1(d) ≥ 1− (d− 1) .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centrally symmetric polytopes with many faces

We present explicit constructions of centrally symmetric polytopes with many faces: (1) we construct a d-dimensional centrally symmetric polytope P with about 3d/4 ≈ (1.316)d vertices such that every pair of non-antipodal vertices of P spans an edge of P , (2) for an integer k ≥ 2, we construct a d-dimensional centrally symmetric polytope P of an arbitrarily high dimension d and with an arbitra...

متن کامل

An Explicit Construction for Neighborly Centrally Symmetric Polytopes

A polytope P ⊂ R is centrally symmetric (cs, for short) if P = −P . A cs polytope P is k-neighborly if every set of k of its vertices, no two of which are antipodes, is the vertex set of a face of P . In their recent paper [7], Linial and Novik give probabilistic constructions for highly neighborly cs polytopes. Namely, based on probabilistic techniques due to Garnaev and Gluskin [4], they cons...

متن کامل

QUANTUM VERSION OF TEACHING-LEARNING-BASED OPTIMIZATION ALGORITHM FOR OPTIMAL DESIGN OF CYCLIC SYMMETRIC STRUCTURES SUBJECT TO FREQUENCY CONSTRAINTS

As a novel strategy, Quantum-behaved particles use uncertainty law and a distinct formulation obtained from solving the time-independent Schrodinger differential equation in the delta-potential-well function to update the solution candidates’ positions. In this case, the local attractors as potential solutions between the best solution and the others are introduced to explore the solution space...

متن کامل

Classification of pseudo-symmetric simplicial reflexive polytopes

Gorenstein toric Fano varieties correspond to so called reflexive polytopes. If such a polytope contains a centrally symmetric pair of facets, we call the polytope, respectively the toric variety, pseudo-symmetric. Here we present a complete classification of pseudo-symmetric simplicial reflexive polytopes. This is a generalization of a result of Ewald on pseudosymmetric nonsingular toric Fano ...

متن کامل

How Neighborly Can a Centrally Symmetric Polytope Be?

We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = Θ ( d 1 + log((d + n)/d) ) . We also show that this bound is tight.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2008